A Heuristic for Near-Optimal Troubleshooting Using AO*
نویسندگان
چکیده
When troubleshooting malfunctioning technical equipment, the task is to locate faults and make repairs until the equipment functions properly again. The AO* algorithm can be used to find troubleshooting strategies that are optimal in the sense that the expected cost of repair is minimal. We have adapted the AO* algorithm for troubleshooting in the automotive domain with limited time. We propose a new heuristic based on entropy. By using this heuristic, near-optimal strategies can be found within a fixed time limit. This is shown in empirical studies on a fuel injection system of a truck. In these results, the AO* algorithm using the new heuristic, performs better than other troubleshooting algorithms.
منابع مشابه
Heuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملFORECASTING TRANSPORT ENERGY DEMAND IN IRAN USING META-HEURISTIC ALGORITHMS
This paper presents application of an improved Harmony Search (HS) technique and Charged System Search algorithm (CSS) to estimate transport energy demand in Iran, based on socio-economic indicators. The models are developed in two forms (exponential and linear) and applied to forecast transport energy demand in Iran. These models are developed to estimate the future energy demands based on pop...
متن کاملAn Improved Standard Cell Placement Methodology using Hybrid Analytic and Heuristic Techniques
In recent years, size of VLSI circuits is dramatically grown and layout generation of current circuits has become a dominant task in design flow. Standard cell placement is an effective stage of physical design and quality of placement affects directly on the performance, power consumption and signal immunity of design. Placement can be performed analytically or heuristically. Analytical placer...
متن کاملA Troubleshooting Approach with Dependent Actions
The basic decision-theoretic troubleshooting task is described in this paper. Dependency sets are defined for a better understanding of dependent actions. It is shown that an optimal troubleshooting sequence is achievable once these sets are solved optimally. Then, an efficient heuristic method is introduced that adjusts action efficiencies myopically and performs a greedy search. Performance o...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008